Some Computational Aspects of Essential Properties of Evolution and Life

While evolution has inspired algorithmic methods of heuristic optimisation, little has been done in the way of using concepts of computation to advance our understanding of salient aspects of biological evolution. We argue that under reasonable assumptions, interesting conclusions can be drawn that are of relevance to behavioural evolution. We will focus on two important features of life--robustness and fitness optimisation--which, we will argue, are related to algorithmic probability and to the thermodynamics of computation, subjects that may be capable of explaining and modelling key features of living organisms, and which can be used in understanding and formulating algorithms of evolutionary computation

Approximations of Algorithmic and Structural Complexity Validate Cognitive-behavioural Experimental Results

We apply methods for estimating the algorithmic complexity of sequences to behavioural sequences of three landmark studies of animal behavior each of increasing sophistication, including foraging communication by ants, flight patterns of fruit flies, and tactical deception and competition strategies in rodents. In each case, we demonstrate that approximations of Logical Depth and Kolmogorv-Chaitin complexity capture and validate previously reported results, in contrast to other measures such as Shannon Entropy, compression or ad hoc. Our method is practically useful when dealing with short sequences, such as those often encountered in cognitive-behavioural research. Our analysis supports and reveals non-random behavior (LD and K complexity) in flies even in the absence of external stimuli, and confirms the "stochastic" behaviour of transgenic rats when faced that they cannot defeat by counter prediction. The method constitutes a formal approach for testing hypotheses about the mechanisms underlying animal behaviour.Comment: 28 pages, 7 figures and 2 table

Queller’s separation condition explained and defended

The theories of inclusive fitness and multilevel selection provide alternative perspectives on social evolution. The question of whether these perspectives are of equal generality remains a divisive issue. In an analysis based on the Price equation, Queller argued (by means of a principle he called the separation condition) that the two approaches are subject to the same limitations, arising from their fundamentally quantitative-genetical character. Recently, van Veelen et al. have challenged Queller’s results, using this as the basis for a broader critique of the Price equation, the separation condition, and the very notion of inclusive fitness. Here we show that the van Veelen et al. model, when analyzed in the way Queller intended, confirms rather than refutes his original conclusions. We thereby confirm (i) that Queller’s separation condition remains a legitimate theoretical principle and (ii) that the standard inclusive fitness and multilevel approaches are indeed subject to the same limitations

Measuring Chess Experts' Single-Use Sequence Knowledge: An Archival Study of Departure from ‘Theoretical’ Openings

The respective roles of knowledge and search have received considerable attention in the literature on expertise. However, most of the evidence on knowledge has been indirect – e.g., by inferring the presence of chunks in long-term memory from performance in memory recall tasks. Here we provide direct estimates of the amount of monochrestic (single use) and rote knowledge held by chess players of varying skill levels. From a large chess database, we analyzed 76,562 games played in 2008 by individuals ranging from Class B players (average players) to Masters to measure the extent to which players deviate from previously known initial sequences of moves (“openings”). Substantial differences were found in the number of moves known by players of different skill levels, with more expert players knowing more moves. Combined with assumptions independently made about the branching factor in master games, we estimate that masters have memorized about 100,000 opening moves. Our results support the hypothesis that monochrestic knowledge is essential for reaching high levels of expertise in chess. They provide a direct, quantitative estimate of the number of opening moves that players have to know to reach master level

Progress Towards a NASA Earth Science Reuse Enablement System (RES)

A Reuse Enablement System (RES) allows developers of Earth science software to contribute software for reuse by others and.for users to find, select, and obtain software for reuse in their own systems. This paper describes work that the X4S,4 Earth Science Data Systems (ESDS) Software Reuse Working Group has completed to date in the development of an RES for NASA

Software Reuse Methods to Improve Technological Infrastructure for e-Science

Social computing has the potential to contribute to scientific research. Ongoing developments in information and communications technology improve capabilities for enabling scientific research, including research fostered by social computing capabilities. The recent emergence of e-Science practices has demonstrated the benefits from improvements in the technological infrastructure, or cyber-infrastructure, that has been developed to support science. Cloud computing is one example of this e-Science trend. Our own work in the area of software reuse offers methods that can be used to improve new technological development, including cloud computing capabilities, to support scientific research practices. In this paper, we focus on software reuse and its potential to contribute to the development and evaluation of information systems and related services designed to support new capabilities for conducting scientific research

The Structure of High Strehl Ratio Point-Spread Functions

We describe the symmetries present in the point-spread function (PSF) of an optical system either located in space or corrected by an adaptive o to Strehl ratios of about 70% and higher. We present a formalism for expanding the PSF to arbitrary order in terms of powers of the Fourier transform of the residual phase error, over an arbitrarily shaped and apodized entrance aperture. For traditional unapodized apertures at high Strehl ratios, bright speckles pinned to the bright Airy rings are part of an antisymmetric perturbation of the perfect PSF, arising from the term that is first order in the residual phase error. There are two symmetric second degree terms. One is negative at the center, and, like the first order term, is modulated by the perfect image's field strength -- it reduces to the Marechal approximation at the center of the PSF. The other is non-negative everywhere, zero at the image center, and can be responsible for an extended halo -- which limits the dynamic range of faint companion detection in the darkest portions of the image. In regimes where one or the other term dominates the speckles in an image, the symmetry of the dominant term can be exploited to reduce the effect of those speckles, potentially by an order of magnitude or more. We demonstrate the effects of both secondary obscuration and pupil apodization on the structure of residual speckles, and discuss how these symmetries can be exploited by appropriate telescope and instrument design, observing strategies, and filter bandwidths to improve the dynamic range of high dynamic range AO and space-based observations. Finally, we show that our analysis is relevant to high dynamic range coronagraphy.Comment: Accepted for publication in ApJ; 20 pages, 4 figure